Resource-bounded measure on probabilistic classes
نویسنده
چکیده
We extend Lutz’s resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. Unlike former attempts, our resource bounded measure notions satisfy all three basic measure properties, that is every singleton {L} has measure zero, the whole space has measure one, and “enumerable infinite unions” of measure zero sets have measure zero.
منابع مشابه
Baire Categories on Small Complexity Classes and Meager-Comeager Laws
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ on how the corresponding finite extension strategies are computed. We give an alternative characterization of small sets via resource-bounded Banach-Mazur games. As an application of the first notion, we show that for...
متن کاملProbabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness properties. Probabilistic martingales can simulate the “betting games” of [BMR98], and can cover the same class that a “natural proof” diagonalizes against, as implicitly already shown in [RSC95]. The notion would become a fu...
متن کاملMeasuring in PSPACE
Results of the kind \Almost every oracle in exponential space separates P from NP" or \Almost every set in exponential time is P-bi-immune" can be precisely formulated via a new approach in Structural Complexity recently introduced by Lutz. He deenes a resource-bounded measure in exponential time and space classes that generalizes Lebesgue measure, a powerful mathematical tool. We investigate h...
متن کاملRelative to a Random Oracle , NP Is Not
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity classes. Lutz has proposed the hypothesis that NP does not have p-measure zero, meaning loosely that NP contains a non-negligible subset of exponential time. This hypothesis implies a strong separation of P from NP and is ...
متن کاملOn the Robustness of ALMOST-R
We study the classes of the form ALMOST-R, for R a reducibility. characterization of these classes in terms of reductions to n-random languages , a subclass of algorithmically random languages. We also discuss the possibility of characterizing the classes ALMOST-R in terms of resource bounded measure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 106 شماره
صفحات -
تاریخ انتشار 2008